Laplace’s Equation in the Exterior of a Convex Polygon. the Equilateral Triangle

نویسندگان

  • A. Charalambopoulos
  • G. Dassios
چکیده

A general method for studying boundary value problems for linear and for integrable nonlinear partial differential equations in two dimensions was introduced in [3]. For linear equations in a convex polygon [2,4,5], this method: (a) Expresses the solution q(x,y) in the form of an integral (generalized inverse Fourier transform) in the complex k-plane involving a certain function q̂(k) (generalized direct Fourier transform) which is defined as an integral along the boundary of the polygon, (b) Characterizes a generalized Dirichlet-to-Neumann map by analyzing the so-called global relation. For simple polygons and simple boundary conditions, this characterization is explicit. Here, we extend the above method to the case of elliptic partial differential equations in the exterior of a convex polygon and we illustrate the main ideas by studying the Laplace equation in the exterior of an equilateral triangle. Regarding (a), we show that whereas q̂(k) is identical with that of the interior problem, the contour of integration in the complex k-plane appearing in the formula for q(x,y) depends on (x,y). Regarding (b), we show that the global relation is now replaced by a set of appropriate relations which in addition to the boundary values also involve certain additional unknown functions. In spite of this significant complication we show that for certain simple boundary conditions the exterior problem for the Laplace equation can be mapped to the solution of a Dirichlet problem formulated in the interior of a convex polygon formed by three sides.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Laplace’s Equation in the Exterior of a Convex Polygon. the Equilateral Triangle

A general method for studying boundary value problems for linear and for integrable nonlinear partial differential equations in two dimensions was introduced in Fokas, 1997. For linear equations in a convex polygon (Fokas and Kapaev (2000) and (2003), and Fokas (2001)), this method: (a) expresses the solution q(x, y) in the form of an integral (generalized inverse Fourier transform) in the comp...

متن کامل

Improving Lower Bound on Opaque Set for Equilateral Triangle

An opaque set (or a barrier) for U ⊆ R is a set B of finite-length curves such that any line intersecting U also intersects B. In this paper, we consider the lower bound for the shortest barrier when U is the unit equilateral triangle. The known best lower bound for triangles is the classic one by Jones [9], which exhibits that the length of the shortest barrier for any convex polygon is at lea...

متن کامل

A note on perfect dissections of an equilateral triangle

A perfect dissection of a polygon P into a polygon P ′ is a decomposition of P into internally disjoint pairwise incongruent polygons all similar to P ′. It is known that there is no perfect dissection of an equilateral triangle into smaller equilateral triangles. On the other hand, an equilateral triangle has trivial perfect dissections into any number n of right triangles where n ≥ 3. We give...

متن کامل

On Viviani’s Theorem and its Extensions

Viviani’s theorem states that the sum of distances from any point inside an equilateral triangle to its sides is constant. We consider extensions of the theorem and show that any convex polygon can be divided into parallel segments such that the sum of the distances of the points to the sides on each segment is constant. A polygon possesses the CVS property if the sum of the distances from any ...

متن کامل

Algorithm for finding the largest inscribed rectangle in polygon

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009